A binary labelling for plane Laman graphs and quadrangulations
نویسندگان
چکیده
We provide binary labellings for the angles of quadrangulations and plane Laman graphs which are in analogy with Schnyder labellings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990].
منابع مشابه
Binary labelings for bipartite graphs
Part of the authors introduced in [C. Huemer, S. Kappes, A binary labelling for plane Laman graphs and quadrangulations, in Proceedings of the 22nd European Workshop on Computational Geometry 83–86, 2006] a binary labeling for the angles of plane quadrangulations, similar to Schnyder labelings of the angles of plane triangulations since in both cases the labelings are equivalent to tree decompo...
متن کاملA binary labeling for plane Laman graphs and quadrangulations
We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular, we show how to embed quadrangulations on a 2-book, so that each page contains a non-crossing alte...
متن کاملBinary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow ...
متن کاملOn the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs
This paper is concerned with the crossing number of Euclidean minimum-weight Laman graphs in the plane. We first investigate the relation between the Euclidean minimum-weight Laman graph and proximity graphs, and then we show that the Euclidean minimum-weight Laman graph is quasi-planar and 6-planar. Thus the crossing number of the Euclidean minimum-weight Laman graph is linear in the number of...
متن کاملFaster Algorithms for Rigidity in the Plane
In [1], a new construction called red-black hierarchy characterizing Laman graphs and an algorithm for computing it were presented. For a Laman graph G = (V,E) with n vertices it runs in O(n) time assuming that a partition of G + e, e ∈ E into two spanning trees is given. We show that a simple modification reduces the running time to O(n log n). The total running time can be reduced O(n √ n log...
متن کامل